Log-Based Reduction by Rewriting
نویسندگان
چکیده
Software systems often produce logs which contain information about the execution of the systems. When an error occurs, the log file with the error is reported for subsequent analysis. The longer the log file, the harder to identify the cause of the observed error. This problem can be considerably simplified, if we reduce the log length, e.g., by removing events which do not contribute towards finding the error. This paper addresses the problem of log reduction by rewriting the reported log in such a way that it preserves the ability to reproduce the same error. The approach exploits rewrite rules inferred from a set of predefined algebraic rewrite rule patterns, capturing such properties as commutativity and identity. The paper presents an algorithm for inferencing the rewrite rules from logs and a terminating reduction strategy based on these rules. Being log-based the inference algorithm is inherently imprecise. So the inferred rules need to be inspected by an expert before actually being used for rewriting. The approach is language independent and highly flexible. The paper formally defines all used concepts and discusses a prototype implementation of a log reduction framework. The prototype was empirically validated on a web shop application. Keywords-logging; fault localisation; log reduction; log rewriting; property mining;
منابع مشابه
A geometric proof of confluence by decreasing diagrams
The criterion for con uence using decreasing diagrams is a generalization of several well-known con uence criteria in abstract rewriting, such as the strong con uence lemma. We give a new proof of the decreasing diagram theorem based on a geometric study of in nite reduction diagrams, arising from unsuccessful attempts to obtain a con uent diagram by tiling with elementary diagrams. 2000 Mathem...
متن کاملOn Efficient Reduction Algorithms for Some Trace Rewriting Systems
We consider some basic problems on the decidability and complexity of trace rewriting systems. The new contribution of this paper is an O(n log(n)) algorithm for some computing irreducible normal forms in the case of certain one-rule systems.
متن کاملMethylene Blue Based Device for Pathogen Reduction in Human Plasma
Abstract Background Despite improvement in safety of plasma transfusion some virus transmission still remains a problem. So as World Health Organization (WHO) recommends, many countries developed Pathogen Reduction Technologies (PRT) to inactivate pathogens, in plasma components. The Methylene Blue (MB) based methods is one of the most universal one. The purpose of this research was, produce...
متن کاملPostponement, conservation and preservation of strong normalization for generalized reduction
متن کامل
Conversion to tail recursion in term rewriting
Tail recursive functions are a special kind of recursive functions where the last action in their body is the recursive call. Tail recursion is important for a number of reasons (e.g., they are usually more efficient). In this article, we introduce an automatic transformation of first-order functions into tail recursive form. Functions are defined using a (first-order) term rewrite system. We p...
متن کامل